Toric Newton Method for Polynomial Homotopies

نویسنده

  • Jan Verschelde
چکیده

This paper deenes a generalization of Newton's method to deal with solution paths de-ned by polynomial homotopies that lead to extremal values. Embedding the solutions in a toric variety leads to explicit scaling relations between coeecients and solutions. Toric Newton is a symbolic-numeric algorithm where the symbolic pre-processing exploits the polyhedral structures. The numerical stage uses the additional variables introduced by the homogenization to scale the components of the solution vectors to the complex unit circle. Toric Newton generates appropriate aane charts and enables to approximate the magnitude of large solutions of polynomial systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Certified predictor-corrector tracking for Newton homotopies

We develop certified tracking procedures for Newton homotopies, which are homotopies for which only the constant terms are changed. For these homotopies, our certified procedures include using a constant predictor with Newton corrections, an Euler predictor with no corrections, and an Euler predictor with Newton corrections. In each case, the predictor is guaranteed to produce a point in the qu...

متن کامل

Term Paper Almost-toric Projective Hypersurfaces

Almost-toric projective hypersurfaces could be parameterized by n+2 monomials in n variables multiplying univariate polynomials in an extra variable. In this paper we give a combinatorial description of the Newton polytope (actually it’s a polygon) of the defining polynomial of almosttoric hypersurfaces.

متن کامل

Homogeneous coordinate rings and mirror symmetry for toric varieties

In this paper we give some evidence for M Kontsevich’s homological mirror symmetry conjecture [13] in the context of toric varieties. Recall that a smooth complete toric variety is given by a simplicial rational polyhedral fan ∆ such that |∆| = Rn and all maximal cones are non-singular (Fulton [10, Section 2.1]). The convex hull of the primitive vertices of the 1–cones of ∆ is a convex polytope...

متن کامل

Error estimation of ‎f‎uzzy Newton-Cotes method for Integration of fuzzy functions‎

Fuzzy Newton-Cotes method for integration of fuzzy functions that was proposed by Ahmady in [1]. In this paper we construct error estimate of fuzzy Newton-Cotes method such as fuzzy Trapezoidal rule and fuzzy Simpson rule by using Taylor's series. The corresponding error terms are proven by two theorems. We prove that the fuzzy Trapezoidal rule is accurate for fuzzy polynomial of degree one and...

متن کامل

A Polyhedral Method to Compute All Affine Solution Sets of Sparse Polynomial Systems

To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible decomposition of a variety is typically understood in affine space, including also those components with zero coordinates. We present a polyhedral method to compute ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2000